Sombor Index over the Tensor and Cartesian Products of Monogenic Semigroup Graphs
نویسندگان
چکیده
Consider a simple graph G with vertex set V(G) and edge E(G). A invariant for is number related to the structure of G, which under symmetry G. The Sombor index new defined as SO(G)=∑uv∈E(G)(du)2+(dv)2. In this work, we connected theory abstract algebra. We computed topological over tensor Cartesian products monogenic semigroup by presenting two different algorithms; obtained results are illustrated examples.
منابع مشابه
Circular chromatic index of Cartesian products of graphs
The circular chromatic index of a graph G, written χ′c(G), is the minimum r permitting a function f : E(G) → [0, r) such that 1 ≤ |f(e)− f(e)| ≤ r − 1 whenever e and e are incident. Let G = H2C2m+1, where 2 denotes Cartesian product and H is an (s − 2)-regular graph of odd order, with s ≡ 0 mod 4 (thus G is sregular). We prove that χ′c(G) ≥ s+ ⌊λ(1− 1/s)⌋ , where λ is the minimum, over all base...
متن کاملWiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
متن کاملCartesian Closed Topological Categories and Tensor Products
The projective tensor product in a category of topologicalR-modules (where R is a topological ring) can be defined in Top, the category of topological spaces, by the same universal property used to define the tensor product of R-modules in Set. In this article, we extend this definition to an arbitrary topological category X and study how the cartesian closedness of X is related to the monoidal...
متن کاملPolytopality and Cartesian products of graphs
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we present three families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On ...
متن کاملEmbedding Cartesian Products of Graphs into De Bruijn Graphs Embedding Cartesian Products of Graphs into De Bruijn Graphs
(m 2) of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when n is greater than three or when n equals three and m is greater than two. For n = 3 and m = 2, we can show for wide classes of graphs that G cannot be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14051071